#include "BinaryGraph.h"

template<class T>
BinaryGraph<T>::BinaryGraph(void)
{
}

template<class T>
BinaryGraph<T>::~BinaryGraph(void)
{
}

template<class T>
void BinaryGraph<T>::AddNode(const Vertex & v)
{
  Node node;
  node.SetMe(v);
  push_back
}

template<class T>
void BinaryGraph<T>::AddNeighbor(const Vertex & parent,const Vertex & current)
{
  //T * t new T();
  //find parent in the list
}







void Tree::AddFirstElement(const Vertex & v)
{
  Node node;
  node.SetMe(v);
  node.SetCost(0);
  push_back(node);
}

void Tree::AddElement(const Vertex & parent, const Vertex & child)
{
  Node node;
  node.SetMe(child);
  //node.SetParent();
  //this->at(FindNode(parent)).AddNeighbor(node);
}

TreeIterator & Tree::FindNode(const Vertex & v)
{
  for(m_nghIt = begin();
      m_nghIt != end();
      m_nghIt ++)
  {
    if( (*m_nghIt) == v )
      break;
  }
  return(m_nghIt);
}